Time Average Replicator and Best-Reply Dynamics

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time Average Replicator and Best-Reply Dynamics

where K is the set of pure strategies, ∆ = ∆(K) is the set of mixed strategies (the simplex on K), e is the k unit vector in ∆, xt ∈ ∆ is the composition of the population at time t with x k t denoting the frequency of strategy k. It was introduced by Taylor and Jonker [25] as the basic selection dynamics for the evolutionary games of Maynard Smith [20], see Hofbauer and Sigmund [16] for a summ...

متن کامل

Asynchronous Best-Reply Dynamics

In many real-world settings (e.g., interdomain routing in the Internet) strategic agents are instructed to follow best-reply dynamics in asynchronous environments. In such settings players learn of each other’s actions via update messages that can be delayed or even lost. In particular, several players might update their actions simultaneously, or make choices based on outdated information. In ...

متن کامل

Refined best reply correspondence and dynamics

We call a correspondence, defined on the set of mixed strategy profiles, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi–continuous, (3) always includes a best reply to any mixed strategy profile, and (4) is convexand closed-valued. For each generalized best reply correspondence, we define a generalized best reply dynamics as a differential inclusion...

متن کامل

Best Reply Dynamics for Scoring Rules

We consider best-reply dynamics for voting games in which all players are strategic and no coalitions are formed. We study the class of scoring rules, show convergence of a suitably restricted version for the plurality and veto rules, and failure of convergence for other rules including k-approval and Borda. In particular, for 3 candidates convergence fails for all rules other than plurality an...

متن کامل

Time Averages , Recurrence and Transience in the Stochastic Replicator Dynamics

We investigate the long-run behavior of a stochastic replicator process, which describes game dynamics for a symmetric two-player game under aggregate shocks. We establish an averaging principle that relates time averages of the process and Nash equilibria of a suitably modified game. Furthermore, a sufficient condition for tran-sience is given in terms of mixed equilibria and definiteness of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Operations Research

سال: 2009

ISSN: 0364-765X,1526-5471

DOI: 10.1287/moor.1080.0359